Speech Compression With Masked Modulated Lapped Transform And SPIHT Algorithm

نویسندگان

  • MAITREYEE DUTTA
  • RENU VIG
چکیده

-A new method of speech compression using the Modulated Lapped Transform(MLT) and Set Partitioning In Hierarchical Trees (SPIHT) algorithm is proposed in this paper. The improvement in the signal with the application of masking with Psychoacoustic model has also been discussed. The proposed scheme is based on the combination of the Modulated Lapped Transform(MLT) and SPIHT. This paper also describes an excitation level based psychoacoustic model to estimate the simultaneous masking threshold for speech coding. The system has the following stages. 1) a windowing function; 2) a time-to-frequency transformation; 3) an excitation level calculation block 4) a correction factor for estimating masking threshold; 5) the inclusion of the absolute masking threshold; 6) the output Signal-to-Masking ratio. We evaluated the performance by integrating the psychoacoustic model into speech coding. Comparisons are also made with Plain LPC Coder, Voice Excited LPC Coder with the coding of the residual signal with DCT, Voice Excited LPC Coder with the coding of the residual signal with MLT, Voice Excited LPC Coder with the coding of the residual signal with MLT and SPIHT. The performance of the coders described has been assessed by computer simulation in terms of a) Signal –to –noise ratio (SNR) b) Compression ratio c) Percent Root mean square Difference(PRD). d) Informal subjective listening test.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Method of Speech Compression Using Warped Lpc and Mlt-spiht Algorithm

Frequency –warped signal processing techniques are attractive to many wideband speech and audio applications since they have a clear connection to the frequency resolution of human hearing. A warped version of the linear predictive coding (LPC) for speech compression is implemented in this paper and an analysis of the application of Set Partitioning In Hierarchical Trees (SPIHT) algorithm to th...

متن کامل

Audio Compression using the MLT and SPIHT

This paper discusses the application of the Set Partitioning In Hierarchical Trees (SPIHT) algorithm to the compression of audio signals. Simultaneous masking is used to reduce the number of coefficients required for the representation of the audio signal. The proposed scheme is based on the combination of the Modulated Lapped Transform (MLT) and SPIHT. Comparisons are also made with the Discre...

متن کامل

Audio Coding Based on the Modulated Lapped Transform (mlt) and Set Partitioning in Hierarchical Trees

This paper presents an audio coder based on the combination of the Modulated Lapped Transform (MLT) with the Set Partitioning In Hierarchical Trees (SPIHT) algorithm. SPIHT allows scalable coding by transmitting more important information first in an efficient manner. The results presented reveal that the Modulated Lapped Transform (MLT) based scheme produces a high compression ratio for little...

متن کامل

Image coding using lapped biorthogonal transform

The wireless sensor network utilizes image compression algorithms like JPEG, JPEG2000, and SPIHT for image transmission with high coding efficiency. During compression, discrete cosine transform (DCT)–based JPEG has blocking artifacts at low bit-rates. But this effect is reduced by discrete wavelet transform (DWT)–based JPEG2000 and SPIHT algorithm but it possess high computational complexity. ...

متن کامل

Statistical Distributions of the Lapped Transform Coefficients for Images

Discrete Cosine Transform (DCT) based transform coding is very popular in image, video and speech compression due to its good energy compaction and decorrelating properties. However, at low bit rates, the reconstructed images generally suffer from visually annoying blocking artifacts as a result of coarse quantization. Lapped transform was proposed as an alternative to the DCT with reduced bloc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005